Simulative Inference About Nonmonotonic Reasoners

نویسنده

  • Aaron N. Kaplan
چکیده

If one has attributed certain initial beliefs to an agent, it is sometimes possible to reason about further beliefs the agent must hold by observing what conclusions one’s own reasoning mechanism draws when given the initial beliefs as premises. This technique is called simulative inference. In an earlier paper, we described a logic of belief in which the reasoning that generates beliefs is modeled explicitly as a computational process. We used this logic to characterize a class of computational inference mechanisms for which simulative inference is sound, under the assumption that the observer and the observed have similar mechanisms. In this paper, we present a different form of simulative inference, and show that unlike the earlier form, it is sound even for some mechanisms that perform defeasible inference.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Skeptic's Menagerie: Conflictors, Preemptors, Reinstaters, and Zombies in Nonrnonotonic Inheritance

Subtle differences in the method of constructing arguments in inheritance systems can result in profound differences in both the conclusions reached and the efficiency of inference. This paper focuses on issues surrounding the defeat of arguments in nonmonotonic inheritance. Looking primarily at skeptical reasoners, we analyze several types of defeat that may be encountered, especially the defe...

متن کامل

Influencing nonmonotonic reasoning by modifier strength manipulation

Despite the current belief that much common sense reasoning is nonmonotonic in nature, research indicates that only a limited percentage of people are good at nonmonotonic reasoning. Good nonmonotonic reasoners recognize the logical strengths and weaknesses of some arguments. In the present study, we focus on differences in the probabilistic interpretation of the modifiers typically and usually...

متن کامل

Is Intractability of Non-Monotonic Reasoning a Real Drawback?

Several studies about computational complexity of nonmonotonic reasoning (NMR) showed that nonmonotonic inference is significantly harder than classical, monotonic inference. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR fulfills the representation goal. In particular,...

متن کامل

Defaults in Description Logics: So Simple, So Difficult

Frame systems—the ancestors of Description Logics—supported a form of defeasible inheritance and overriding. Such nonmonotonic features disappeared from implementations after the logical reconstruction of frame systems, although applications provide interesting use cases for nonmonotonic inferences. This talk gives an overview of the nonmonotonic DLs introduced so far, and illustrates the many ...

متن کامل

The provenance of modal inference

People reason about possibilities routinely, and reasoners can infer “modal” conclusions, i.e., conclusions that concern what is possible or necessary, from premises that make no mention of modality. For instance, given that Cullen was born in New York or Kentucky, it is intuitive to infer that it’s possible that Cullen was born in New York, and a recent set of studies on modal reasoning bear o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998